package com.samxcode.leetcode;

/**
 * Given an array and a value, remove all instances of that value in place and return the new
 * length.
 * 
 * The order of elements can be changed. It doesn't matter what you leave beyond the new length.
 * 
 * @author Sam
 *
 */
public class RemoveElement {

    public int removeElement(int[] A, int elem) {
        int i = 0;
        for (int j = 0; j < A.length; j++) {
            if (A[j] != elem) {
                A[i++] = A[j];
            }
        }
        return i;
    }
}
